Search results for "Series system"
showing 4 items of 4 documents
A constrained genetic algorithm to optimize a maintenance global service
2014
It is herein developed an approach to optimize the maintenance services policy related to a Global Service Contract. In particular, the latter requires the performing of corrective maintenance and replacements of the failed components on a set of equal vehicles of a logistic Company. The tackled problem concerns the determination of an effective opportunistic maintenance policyon the basis of which when a fault occurs, it is replaced the failed component and, depending on the age of the others components, also replacements of others suitable components are performed, even if they are not yet broken, thus saving a substantial amount of system downtime. The problem is mathematically formulate…
A cost model for the selection of a maintenance activity in a series system
2012
An effective opportunistic maintenance policy for a global service
2010
The aim of the present paper is to develop a model for an effective maintenance policy with refer to a global service contract between a services provider company and a company for the waste management. The contract requires, with fixed performance levels of the service, the supplying of a mandatory set of maintenance services on a set of waste compactors vehicles of the outsourcer company. In particular, the service provider (SP) must perform corrective maintenance actions and the replacement of the fault parts. The tackled problem concerns the determination of an effective opportunistic maintenance policy in order to assure the required service performance levels at the minimum global mai…
Selection of Series System Components to Maximize Reliability
2010
The paper tackles the problem of maximizing the reliability of a series system by an opportune choice of components. Each type of component must be selected among the available alternatives for that component whereas a fixed amount of budget can not be overcome. The problem can be formulated by a binary non linear programming model and it is equivalent to a knapsack problem with multiple-choice constraints, well known to be NP-hard. An exact algorithm is proposed for solving large dimension problems to the optimum in a short time. The algorithm efficiency is finally compared with the recent heuristics proposed in literature to approach the same problem.